DCT-like Transform for Image Compression Requires 14 Additions Only

摘要

A low-complexity 8-point orthogonal approximate DCT is introduced. Theproposed transform requires no multiplications or bit-shift operations. Thederived fast algorithm requires only 14 additions, less than any existing DCTapproximation. Moreover, in several image compression scenarios, the proposedtransform could outperform the well-known signed DCT, as well asstate-of-the-art algorithms.